A Constructive Semantic Characterization of Aggregates in Answer Set Programming TRAN CAO SON and ENRICO PONTELLI
نویسنده
چکیده
This technical note describes a monotone and continuous xpoint operator to compute the answer sets of programs with aggregates. The xpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator aggr P for aggregate programs, independently proposed in (Pelov 2004; Pelov et al. 2004). This operator allows us to closely tie the computational complexity of the answer set checking and answer sets existence problems to the cost of checking a solution of the aggregates in the program. Finally, we relate the semantics described by the operator to other proposals for logic programming with aggregates.
منابع مشابه
A Constructive semantic characterization of aggregates in answer set programming
This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator Φ P for aggregate programs, independently proposed in (Pelov 2004; Pelov et al. 2004). Thi...
متن کاملA Constructive Semantic Characterization of Aggregates in ASP
This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator Φ P for aggregate programs, independently proposed in (Pelov 2004; Pelov et al. 2004). Thi...
متن کاملSmodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP
In this work we propose a semantically well-founded extension of Answer Set Programming (ASP) with aggregates, which relies on the integration between stateof-the-art answer set solvers and constraint logic programming systems. The resulting system is efficient, flexible, extensible, and supports form of aggregation more general than those previously proposed in the literature. The system is de...
متن کاملIntegrating an Answer Set Solver into Prolog: ASP-PROLOG
A number of answer set solvers have been proposed in recent years, such as Smodels, DLV, Cmodels, and ASSAT. Most existing ASP solvers have been extended to provide front-ends that are suitable to encode specialized forms of knowledge—e.g., weight-constraints, restricted forms of optimization, front-ends for planning and diagnosis. These features allow declarative solutions in specific applicat...
متن کامل